Exploiting MaxSAT for Preference-Based Planning
نویسندگان
چکیده
In this paper, we explore the application of partial weighted MaxSAT techniques for preference-based planning (PBP). To this end, we develop a compact partial weighted MaxSAT encoding for PBP based on the SAS formalism. Our encoding extends a SAS based encoding for SAT-based planning, SASE, to allow for the specification of simple preferences. To the best of our knowledge, the SAS formalism has never been exploited in the context of PBP. Our MaxSATbased PBP planner, MSPLAN, significantly outperformed a STRIPS-based MaxSAT approach for PBP with respect to running time, solving more problems in a few cases. Interestingly, when compared to SGPlan5 and HPLAN-P, two stateof-the-art heuristic search planners for PBP, MSPLAN consistently generated plans with comparable quality, slightly outperforming at least one of these two planners in almost every case. For some problems, MSPLAN was competitive with HPLAN-P with respect to running time. Our results illustrate the effectiveness of our SASE based encoding and suggests that MaxSAT-based PBP is a promising area of research.
منابع مشابه
Preference-Based Planning via MaxSAT
In this paper, we explore the application of partial weighted MaxSAT techniques for preference-based planning (PBP). To this end, we develop a compact partial weighted MaxSAT encoding for PBP based on the popular SAS planning formalism. Our encoding extends a SAS based encoding for SAT-based planning, SASE, to allow for the specification of simple preferences. To the best of our knowledge, the ...
متن کاملPartial Weighted MaxSAT for Optimal Planning
We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automated reasoning for that setting, we develop an approach that operates by solving a sequence of partial weighted MaxSAT problems, each of which corresponds to a step-bounded variant of the problem at hand. Our approach is the first...
متن کاملCost-Optimal Planning using Weighted MaxSAT
We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automated reasoning for that setting, we develop an approach that operates by solving a sequence of partial weighted MaxSAT problems, each of which corresponds to a step-bounded variant of the problem at hand. Our approach is the first...
متن کاملOn Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
In recent years, unsatisfiability-based algorithms have become prevalent as state of the art for solving industrial instances of Maximum Satisfiability (MaxSAT). These algorithms perform a succession of unsatisfiable SAT solver calls until an optimal solution is found. In several of these algorithms, cardinality or pseudo-Boolean constraints are extended between iterations. However, in most cas...
متن کاملExploiting subproblem optimization in SAT-based MaxSAT algorithms
The Maximum Satisfiability (MaxSAT) problem is an optimization variant of the Satisfiability (SAT) problem. Several combinatorial optimization problems can be translated into a MaxSAT formula. Among exact MaxSAT algorithms, SAT-based MaxSAT algorithms are the best performing approaches for real-world problems. We have extended the WPM2 algorithm by adding several improvements. In particular, we...
متن کامل